On the Weiss Conjecture for Finite Locally Primitive Graphs
نویسندگان
چکیده
A graph F is said to be locally primitive if, for each vertex a, the stabilizer in Aut F of a induces a primitive permutation group on the set of vertices adjacent to a. In 1978, Richard Weiss conjectured that for a finite vertex-transitive locally primitive graph F, the number of automorphisms fixing a given vertex is bounded above by some function of the valency of F. In this paper we prove that the conjecture is true for finite non-bipartite graphs provided that it is true in the case in which Aut F contains a locally primitive subgroup that is almost simple.
منابع مشابه
$L^p$-Conjecture on Hypergroups
In this paper, we study $L^p$-conjecture on locally compact hypergroups and by some technical proofs we give some sufficient and necessary conditions for a weighted Lebesgue space $L^p(K,w)$ to be a convolution Banach algebra, where $1<p<infty$, $K$ is a locally compact hypergroup and $w$ is a weight function on $K$. Among the other things, we also show that if $K$ is a locally compact hyper...
متن کاملBounding the size of a vertex-stabiliser in a finite vertex-transitive graph
In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a G-vertex-transitive graph Γ. In the main result the group G is quasiprimitive or biquasiprimitive on the vertices of Γ, and we obtain a genuine reduction to the case where G is a nonabelian simple group. Using normal quotient techniques developed by the first author, the main theorem applies to general G-...
متن کاملAn Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملA Counterexample to the Reconstruction Conjecture for Locally Finite Trees
Two graphs G and H are hypomorphic if there exists a bijection φ : V (G)→ V (H) such that G− v ∼= H − φ(v) for each v ∈ V (G). A graph G is reconstructible if H ∼= G for all H hypomorphic to G. It is well known that not all infinite graphs are reconstructible. However, the Harary-Schwenk-Scott Conjecture from 1972 suggests that all locally finite trees are reconstructible. In this paper, we con...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008